Game Agent Learning with Genetic Programming in Pursuit-Evasion Problem
نویسندگان
چکیده
منابع مشابه
Multi-Agent Model-Based Reinforcement Learning Experiments in the Pursuit Evasion Game
This paper describes multi-agent learning experiments performed on tactical sequences of the pursuit evasion game on very small grids. It underlines the performance difference between a centralized approach and a distributed approach when using Rmax, a model-based reinforcement learning algorithm. The prey’s goal is to go out of the grid and the predators’ goal is to kill the prey. The prey may...
متن کاملGame Theory Models for Pursuit Evasion Games
In a pursuit evasion game, the pursuer tries to capture the evader while the evader tries to prevent this capture. A classical approach is to model this game as an infinite differential game. In this report, we model a pursuit-evasion game as a finite extensive form game, and show that the differential game is a generalization of this game. We prove that a pure-strategy Nash equilibrium always ...
متن کاملPursuit-Evasion Differential Game with Many Inertial Players
We consider pursuit-evasion differential game of countable number inertial players in Hilbert space with integral constraints on the control functions of players. Duration of the game is fixed. The payoff functional is the greatest lower bound of distances between the pursuers and evader when the game is terminated. The pursuers try to minimize the functional, and the evader tries to maximize i...
متن کاملMultiple-Agent Probabilistic Pursuit-Evasion Games
In this paper we develop a probabilistic framework for pursuit-evasion games. We propose a “greedy” policy to control a swarm of autonomous agents in the pursuit of one or several evaders. At each instant of time this policy directs the pursuers to the locations that maximize the probability of finding an evader at that particular time instant. It is shown that, under mild assumptions, this pol...
متن کاملMultiple - Agent Probabilistic Pursuit - Evasion Games 1
In this paper we develop a probabilistic framework for pursuit-evasion games. We propose a \greedy" policy to control a swarm of autonomous agents in the pursuit of one or several evaders. At each instant of time this policy directs the pursuers to the locations that maximize the probability of nding an evader at that particular time instant. It is shown that, under mild assumptions, this polic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The KIPS Transactions:PartB
سال: 2008
ISSN: 1598-284X
DOI: 10.3745/kipstb.2008.15-b.3.253